Ordinal Completeness of Bimodal Provability Logic GLB
نویسنده
چکیده
Bimodal provability logic GLB, introduced by G. Japaridze, currently plays an important role in the applications of provability logic to proof-theoretic analysis. Its topological semantics interprets diamond modalities as derived set operators on a bi-scattered bitopological space. We study the question of completeness of this logic w.r.t. the most natural space of this kind, that is, w.r.t. an ordinal α equipped with the interval topology and with the so-called club topology. We show that, assuming the axiom of constructibility, GLB is complete for any α ≥ אω. On the other hand, from the results of A. Blass it follows that, assuming the consistency of “there is a Mahlo cardinal,” it is consistent with ZFC that GLB is incomplete w.r.t. any such space. Thus, the question of completeness of GLB w.r.t. natural ordinal spaces turns out to be independent of ZFC.
منابع مشابه
On Bimodal Logics of Provability
We investigate the bimodal logics sound and complete under the interpretation of modal operators as the provability predicates in certain natural pairs of arithmetical theories (F’, ?2). Carlson characterized the provability logic for essentially reflexive extensions of theories, i.e. for pairs similar to (PA, ZF). Here we study pairs of theories (F’, %!) such that the gap between F and Q is no...
متن کاملOn topological models of GLP
We develop topological semantics of a polymodal provability logic GLP. Our main result states that the bimodal fragment of GLP, although incomplete with respect to relational semantics, is topologically complete. The topological (in)completeness of GLP remains an interesting open problem.
متن کاملOn topological models of GLP Dedicated to Wolfram Pohlers on the occasion of his retirement
We develop topological semantics of a polymodal provability logic GLP. Our main result states that the bimodal fragment of GLP, although incomplete with respect to relational semantics, is topologically complete. The topological (in)completeness of GLP remains an interesting open problem.
متن کاملVeblen hierarchy in the context of provability algebras
We study an extension of Japaridze’s polymodal logic GLP with transfinitely many modalities and develop a provability-algebraic ordinal notation system up to the ordinal Γ0. In the papers [1, 2] a new algebraic approach to the traditional prooftheoretic ordinal analysis was presented based on the concept of graded provability algebra. The graded provability algebra of a formal theory T is its L...
متن کاملAll finitely axiomatizable subframe logics containing the provability logic CSM 0_{0} are decidable
In this paper we investigate those extensions of the bimodal provability logic CSM 0 (alias PRL 1 or F ?) which are subframe logics, i.e. whose general frames are closed under a certain type of substructures. Most bimodal provability logics are in this class. The main result states that all nitely axiomatizable subframe logics containing CSM 0 are decidable. We note that, as a rule, interesting...
متن کامل